On a conjecture of Gentner and Rautenbach
نویسندگان
چکیده
Gentner and Rautenbach conjectured that the size of a minimum zero forcing set in a connected graph on n vertices with maximum degree 3 is at most 1 3 n + 2. We disprove this conjecture by constructing a collection of connected graphs {Gn} with maximum degree 3 on arbitrarily large number of vertices, having zero forcing number at least 4 9 |Gn|.
منابع مشابه
Maximum graphs with a unique minimum dominating set
We present a conjecture on the maximum number of edges of a graph that has a unique minimum dominating set. We verify our conjecture for some special cases and prove a weakened version of this conjecture in general. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملThe k-tuple domination number revisited
The following fundamental result for the domination number γ(G) of a graph G was proved by Alon and Spencer, Arnautov, Lovász and Payan: γ(G) ≤ ln(δ + 1) + 1 δ + 1 n, where n is the order and δ is the minimum degree of vertices of G. A similar upper bound for the double domination number was found by Harant and Henning [On double domination in graphs. Discuss. Math. Graph Theory 25 (2005) 29–34...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کامل$L^p$-Conjecture on Hypergroups
In this paper, we study $L^p$-conjecture on locally compact hypergroups and by some technical proofs we give some sufficient and necessary conditions for a weighted Lebesgue space $L^p(K,w)$ to be a convolution Banach algebra, where $1<p<infty$, $K$ is a locally compact hypergroup and $w$ is a weight function on $K$. Among the other things, we also show that if $K$ is a locally compact hyper...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 341 شماره
صفحات -
تاریخ انتشار 2018